Decorrelating topology with HMC

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decorrelating the topology in full QCD

We investigate the performance of the hybrid Monte Carlo algorithm in updating non-trivial global topological structures. We find that the hybrid Monte Carlo algorithm has serious problems decorrelating the global topological charge. This represents a warning which must be seriously considered when simulating full QCD, regardless of the number and type of fermions, with this or any similar algo...

متن کامل

Ps Processing with Decorrelating Targets

The strength of PS SAR interferometry stays with the availability of point-like targets coherent over many years [2]. In a previous work [4] we have investigated the possibility of extending the analysis to targets showing less ideal scattering properties, through the introduction of a covariance matrix estimated from the radar images. However since it is applied to a late phase of the processi...

متن کامل

Speeding up HMC with better integrators

We discuss how dynamical fermion computations may be made yet cheaper by using symplectic integrators that conserve energy much more accurately without increasing the integration step size. We first explain why symplectic integrators exactly conserve a “shadow” Hamiltonian close to the desired one, and how this Hamiltonian may be computed in terms of Poisson brackets. We then discuss how classi...

متن کامل

Trap models with slowly decorrelating observables

We study the correlation and response dynamics of trap models of glassy dynamics, considering observables that only partially decorrelate with every jump. This is inspired by recent work on a microscopic realization of such models, which found strikingly simple linear out-of-equilibrium fluctuation-dissipation relations in the limit of slow decorrelation. For the Barrat and Mézard model with it...

متن کامل

A family of adaptive filter algorithms with decorrelating properties

Although the normalized least mean square (NLMS) algorithm is robust, it suffers from low convergence speed if driven by highly correlated input signals. One method presented to overcome this problem is the Ozeki/Umeda affine projection (AP) algorithm. The algorithm applies update directions that are orthogonal to the last P input vectors and thus allows decorrelation of an AR(P) input process,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nuclear Physics B - Proceedings Supplements

سال: 1999

ISSN: 0920-5632

DOI: 10.1016/s0920-5632(99)85124-x